Polychromatic coloring for half-planes
نویسندگان
چکیده
منابع مشابه
Coloring half-planes and bottomless rectangles
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings [4]. One of the most interesting type of regions to consider for this problem is that of the axis-parallel rectangles. We completely solve the problem for a special case of them, for bottomless rectangles. We also give an almos...
متن کاملColoring geometric hypergraph defined by an arrangement of half-planes
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
متن کاملVertex coloring without large polychromatic stars
Given an integer k ≥ 2, we consider vertex colorings of graphs in which no k-star subgraph Sk = K1,k is polychromatic. Equivalently, in a star-[k]-coloring the closed neighborhood N[v] of each vertex v can have at most k different colors on its vertices. The maximum number of colors that can be used in a star-[k]-coloring of graph G is denoted by χ̄k⋆(G) and is termed the star-[k] upper chromati...
متن کاملMoving Porous Half-Planes
A shear flow motivated by relatively moving half-planes is theoretically studied in this paper. Either the mass influx or the mass efflux is allowed on the boundary. This flow is called the extended Stokes’ problems. Traditionally, exact solutions to the Stokes’ problems can be readily obtained by directly applying the integral transforms to the momentum equation and the associated boundary and...
متن کاملColoring a geometric hypergraph defined by an arrangement of half-planes
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2012
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2011.07.001